Middle Square Weyl Sequence RNG

نویسنده

  • Bernard Widynski
چکیده

In this article, we propose a new implementation of John von Neumann’s middle square random number generator (RNG). A Weyl sequence is utilized to keep the generator running through a long period.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Manipulating attentional load in sequence learning through random number generation

Implicit learning is often assumed to be an effortless process. However, some artificial grammar learning and sequence learning studies using dual tasks seem to suggest that attention is essential for implicit learning to occur. This discrepancy probably results from the specific type of secondary task that is used. Different secondary tasks may engage attentional resources differently and ther...

متن کامل

Bit recycling for scaling random number generators

Many Random Number Generators (RNG) are available nowadays; they are divided in two categories, hardware RNG, that provide “true” random numbers, and algorithmic RNG, that generate pseudo random numbers (PRNG). Both types usually generate random numbers (Xn)n as independent uniform samples in a range 0, . . . 2 − 1, with b = 8, 16, 32 or b = 64. In applications, it is instead sometimes desirabl...

متن کامل

The random number generation task: psychometric properties and normative data of an executive function task in a mixed sample.

We investigated the psychometric properties of the random number generation (RNG) task in four studies using a mixed sample of young adults (n = 306), middle-aged adults (n = 40), and patients diagnosed with schizophrenia (n = 26). Data in study 1 were best accounted for by a three-factor solution representing inhibition of stereotypical schemas (seriation), output inhibition (repetition), and ...

متن کامل

Fatou's Lemma and the Lebesgue's Convergence Theorem

For simplicity, we adopt the following rules: X denotes a non empty set, F denotes a sequence of partial functions from X into R with the same dom, s1, s2, s3 denote sequences of extended reals, x denotes an element of X, a, r denote extended real numbers, and n, m, k denote natural numbers. We now state several propositions: (1) If for every natural number n holds s2(n) ≤ s3(n), then inf rng s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1704.00358  شماره 

صفحات  -

تاریخ انتشار 2017